Evidence for Fixpoint Logic
نویسندگان
چکیده
For many modal logics, dedicated model checkers offer diagnostics (e.g., counterexamples) that help the user understand the result provided by the solver. Fixpoint logic offers a unifying framework in which such problems can be expressed and solved, but a drawback of this framework is that it lacks comprehensive diagnostics generation. We extend the framework with a notion of evidence, which can be specialised to obtain diagnostics for various model checking problems, behavioural equivalence and refinement checking problems. We demonstrate this by showing how our notion of evidence can be used to obtain diagnostics for the problem of deciding stuttering bisimilarity. Moreover, we show that our notion generalises the existing notions of counterexample and witness for LTL and ACTL* model checking. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory
In recent years several extensions of first-order logic have been investigated in the context of finite-model theory. Fixpoint logic and the infinitary logic L∞ω with a finite number of variables have turned out to be of particular importance. The study of fixpoint logic generated interactions with both database theory and complexity theory, while the infinitary logic L∞ω proved to be a useful ...
متن کاملGames for Topological Fixpoint Logic
Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational structures based on Stone spaces, where the fixpoint operators are interpreted via clopen sets. We develop a game-theoretic semantics for this logic. First we i...
متن کاملPartial Grounded Fixpoints
Approximation fixpoint theory (AFT) is an algebraical study of fixpoints of lattice operators. Recently, AFT was extended with the notion of a grounded fixpoint. This type of fixpoint formalises common intuitions from various application domains of AFT, including logic programming, default logic, autoepistemic logic and abstract argumentation frameworks. The study of groundedness was limited to...
متن کاملFixpoint Extensions of Temporal Description Logics
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Description Logics to obtain decidability and tight complexity results for temporal fixpoint extensions of these Description Logics and more generally for the decidable monodic fragments of first order logic.
متن کاملGrounded Fixpoints
Algebraical fixpoint theory is an invaluable instrument for studying semantics of logics. For example, all major semantics of logic programming, autoepistemic logic, default logic and more recently, abstract argumentation have been shown to be induced by the different types of fixpoints defined in approximation fixpoint theory (AFT). In this paper, we add a new type of fixpoint to AFT: a ground...
متن کامل